Fuzzy Description Logics and t-norm based fuzzy logics

نویسندگان

  • Àngel García-Cerdaña
  • Eva Armengol
  • Francesc Esteva
چکیده

Description Logics (DLs) are knowledge representation languages built on the basis of classical logic. DLs allow the creation of knowledge bases and provide ways to reason on the contents of these bases. Fuzzy Description Logics (FDLs) are natural extensions of DLs for dealing with vague concepts, commonly present in real applications. Hájek proposed to deal with FDLs taking as basis t-norm based fuzzy logics with the aim of enriching the expressive possibilities in FDLs and to capitalize on recent developments in the field of Mathematical Fuzzy Logic. From this perspective we define a family of description languages, denoted by ALCðSÞ, which includes truth constants for representing truth degrees. Having truth constants in the language allows us to define the axioms of the knowledge bases as sentences of a predicate language in much the same way as in classical DLs. On the other hand, taking advantage of the expressive power provided by these truth constants, we define a graded notion of satisfiability, validity and subsumption of DL concepts as the satisfiability, validity and subsumption of evaluated formulas. In the last section we summarize some results concerning fuzzy logics associated with these new description languages, we analyze aspects relative to general and canonical semantics, and we prove some results relative to canonical standard completeness for some FDLs considered in the paper. ! 2010 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Description Logics with Fuzzy Concrete Domains

We present a fuzzy version of description logics with concrete domains. Main features are: (i) concept constructors are based on t-norm, t-conorm, negation and implication; (ii) concrete domains are fuzzy sets; (iii) fuzzy modifiers are allowed; and (iv) the reasoning algorithm is based on a mixture of completion rules and bounded mixed integer programming.

متن کامل

On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm

The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. Recently, it has been shown that, in the presence of general concept inclusion axioms (GCIs),...

متن کامل

Fuzzy description logics with general t-norms and datatypes

Fuzzy description logics (DLs) are a family of logics which allow the representation of (and the reasoning within) structured knowledge affected by vagueness. Although a relatively important amount of work has been carried out in the last years, current fuzzy DLs still present several limitations. In this work we face two problems: the common restriction to Zadeh and Łukasiewicz fuzzy logics an...

متن کامل

On Triangular Norm Based Fuzzy Description Logics

Description Logics (DLs) are knowledge representation languages useful to represent concepts and roles. Fuzzy Description Logics (FDLs) incorporate both vague concepts and vague roles modeling them as fuzzy sets and fuzzy relations respectively. In the present paper, following ideas from Hájek, we propose the use of t-norm based (fuzzy) logics with truth constants in the language as logics unde...

متن کامل

Learning in Description Logics with Fuzzy Concrete Domains

We present a fuzzy version of description logics with concrete domains. Main features are: (i) concept constructors are based on t-norm, t-conorm, negation and implication; (ii) concrete domains are fuzzy sets; (iii) fuzzy modifiers are allowed; and (iv) the reasoning algorithm is based on a mixture of completion rules and bounded mixed integer programming.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2010